- approximate differentiability
- мат.аппроксимативная дифференцируемость
English-Russian scientific dictionary. 2008.
English-Russian scientific dictionary. 2008.
Derivative — This article is an overview of the term as used in calculus. For a less technical overview of the subject, see Differential calculus. For other uses, see Derivative (disambiguation) … Wikipedia
analysis — /euh nal euh sis/, n., pl. analyses / seez /. 1. the separating of any material or abstract entity into its constituent elements (opposed to synthesis). 2. this process as a method of studying the nature of something or of determining its… … Universalium
Mollifier — A mollifier (top) in dimension one. At the bottom, in red is a function with a corner (left) and sharp jump (right), and in blue is its mollified version. In mathematics, mollifiers (also known as approximations to the identity) are smooth… … Wikipedia
Tetration — In mathematics, tetration (also known as hyper 4) is an iterated exponential, the first hyper operator after exponentiation. The portmanteau word tetration was coined by English mathematician Reuben Louis Goodstein from tetra (four) and iteration … Wikipedia
Arc length — Determining the length of an irregular arc segment is also called rectification of a curve. Historically, many methods were used for specific curves. The advent of infinitesimal calculus led to a general formula that provides closed form… … Wikipedia
Optimal design — This article is about the topic in the design of experiments. For the topic in optimal control theory, see shape optimization. Gustav Elfving developed the optimal design of experiments, and so minimized surveyors need for theodolite measurements … Wikipedia
Differential of a function — For other uses of differential in mathematics, see differential (mathematics). In calculus, the differential represents the principal part of the change in a function y = ƒ(x) with respect to changes in the independent variable. The… … Wikipedia
Cox's theorem — Cox s theorem, named after the physicist Richard Threlkeld Cox, is a derivation of the laws of probability theory from a certain set of postulates. This derivation justifies the so called logical interpretation of probability. As the laws of… … Wikipedia
Linear interpolation — is a method of curve fitting using linear polynomials. It is heavily employed in mathematics (particularly numerical analysis), and numerous applications including computer graphics. It is a simple form of interpolation. Lerp is a quasi acronym… … Wikipedia
Bounded variation — In mathematical analysis, a function of bounded variation refers to a real valued function whose total variation is bounded (finite): the graph of a function having this property is well behaved in a precise sense. For a continuous function of a… … Wikipedia
Nonlinear programming — In mathematics, nonlinear programming (NLP) is the process of solving a system of equalities and inequalities, collectively termed constraints, over a set of unknown real variables, along with an objective function to be maximized or minimized,… … Wikipedia